Mutually Exclusive Modules in Logic Programming
نویسنده
چکیده
Logic programming has traditionally lacked devices for expressing mutually exclusive modules. We address this limitation by adopting choice-conjunctive modules of the form D0&D1 where D0, D1 are a conjunction of Horn clauses and & is a linear logic connective. Solving a goal G using D0&D1 – ex(D0&D1, G) – has the following operational semantics: choose a successful one between ex(D0, G) and ex(D1, G). In other words, if D0 is chosen in the course of solving G, then D1 will be discarded and vice versa. Hence, the class of choice-conjunctive modules can capture the notion of mutually exclusive modules. keywords: mutual exclusion, cut, linear logic, choice-conjunction.
منابع مشابه
Mutually Exclusive Rules in Logic Programming
A technique to detect that pairs of rules are \mutually exclusive" in a logic program is described. In contrast to previous work our algorithm derives mutual exclusion by looking not only on built-in, but also user-de ned predicates. This technique has applications to optimization of the execution of programs containing these rules. Additionally, the programmer is less dependent on non-logical ...
متن کاملMutally Exclusive Rules in Logic Programming
A technique to detect that pairs of rules are “mutually exclusive” in a logic program is described. In contrast to previous work our algorithm derives mutual exclusion by looking not only on built-in, but also user-defined predicates. This technique has applications to optimization of the execution of programs containing these rules. Additionally, the programmer is less dependent on non-logical...
متن کاملPromoting Modular Nonmonotonic Logic Programs
Modularity in Logic Programming has gained much attention over the past years. To date, many formalisms have been proposed that feature various aspects of modularity. In this paper, we present our current work on Modular Nonmonotonic Logic Programs (MLPs), which are logic programs under answer set semantics with modules that have contextualized input provided by other modules. Moreover, they al...
متن کاملChoice Disjunctive Queries in Logic Programming
One of the long-standing research problems on logic programming is to treat the cut predicate in a logical, high-level way. We argue that this problem can be solved by adopting linear logic and choice-disjunctive goal formulas of the form G0 ⊕G1 where G0, G1 are goals. These goals have the following intended semantics: choose the true disjunct Gi and execute Gi where i(= 0 or 1), while discardi...
متن کاملDynamic Logic Programming
In this paper we investigate updates of knowledge bases represented by logic programs. In order to represent negative information, we use generalized logic programs which allow default negation not only in rule bodies but also in their heads.We start by introducing the notion of an update P U of a logic program P by another logic program U . Subsequently, we provide a precise semantic character...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1506.04857 شماره
صفحات -
تاریخ انتشار 2015